Low-cost Bit Permutation Circuit with Concise Configuration Rule

Bit-level permutation is widely used in cryptography systems. However, it is not well-supported in simple and low-cost way. Here, a low-cost construction of n-bit permutation circuit capability of n! permutations is proposed. This construction just needs one n-to-1 multiplexer and (2n + n ∗ ⌈log2n⌉) bits registers. Its configuration rule is very concise. Users only straightforward input the numbers that indicate which bit of source data will go to i-th bit of destination data. The Synopsys’ DC synthesis results show that approximate 31% of the area can be saved by this architecture compared with Benes networks of identical size. This design provides a new perspective on implementation of bit permutation and may be helpful for the design of secure resource-constrained systems.